Monma, Clyde: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

On the Complexity of Scheduling with Batch Setup Times

Clyde L. Monma and Chris N. Potts

Journal:

Operations Research

Year:

1989

Language:

english

File:

PDF, 250 KB

english, 1989

2

Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints

Clyde L. Monma and David F. Shallcross

Journal:

Operations Research

Year:

1989

Language:

english

File:

PDF, 426 KB

english, 1989

3

Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times

Clyde L. Monma and Chris N. Potts

Journal:

Operations Research

Year:

1993

Language:

english

File:

PDF, 454 KB

english, 1993

4

An Implementation of a Primal-Dual Interior Point Method for Linear Programming

McShane, Kevin A., Monma, Clyde L., Shanno, David

Journal:

INFORMS Journal on Computing

Year:

1989

Language:

english

File:

PDF, 1.13 MB

english, 1989

5

Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions

Monma, Clyde L., Schrijver, Alexander, Todd, Michael J., Wei, Victor K.

Journal:

Mathematics of Operations Research

Year:

1990

Language:

english

File:

PDF, 925 KB

english, 1990

6

On the Complexity of Scheduling with Batch Setup Times

Monma, Clyde L., Potts, Chris N.

Journal:

Operations Research

Year:

1989

Language:

english

File:

PDF, 583 KB

english, 1989

7

Threshold tolerance graphs

Clyde L. Monma, Bruce Reed, William T. Trotter Jr.

Journal:

Journal of Graph Theory

Year:

1988

Language:

english

File:

PDF, 994 KB

english, 1988

8

Operations Research Support Methodology, Albert G. Holzman, Ed., Marcel Dekker, New York, 1979, 648 pp. Price $39.75

Journal:

Year:

1981

Language:

english

File:

PDF, 89 KB

english, 1981

9

Network flow programming, by P. A. Jensen and J. W. Barnes, John Wiley and Sons, Inc., New York, 1980, 408 pp. Price: $28.95

Journal:

Year:

1982

Language:

english

File:

PDF, 93 KB

english, 1982

10

Optimal enclosing regions in planar graphs

Daniel Bienstock, Clyde L. Monma

Journal:

Year:

1989

Language:

english

File:

PDF, 942 KB

english, 1989

11

Intersection graphs of paths in a tree

Clyde L Monma, Victor K Wei

Journal:

Journal of Combinatorial Theory, Series B

Year:

1986

Language:

english

File:

PDF, 2.41 MB

english, 1986

12

Tolerance graphs

Martin Charles Golumbic, Clyde L. Monma, William T. Trotter Jr.

Journal:

Discrete Applied Mathematics

Year:

1984

Language:

english

File:

PDF, 756 KB

english, 1984

13

Subtree and substar intersection numbers

Yi-Wu Chang, Michael S. Jacobson, Clyde L. Monma, Douglas B. West

Journal:

Discrete Applied Mathematics

Year:

1993

Language:

english

File:

PDF, 1.15 MB

english, 1993

14

Computational experience with a dual affine variant of Karmarkar's method for linear programming

Clyde L. Monma, Andrew J. Morton

Journal:

Operations Research Letters

Year:

1987

Language:

english

File:

PDF, 755 KB

english, 1987

15

Minimum-weight two-connected spanning networks

Clyde L. Monma, Beth Spellman Munson, William R. Pulleyblank

Journal:

Mathematical Programming

Year:

1990

Language:

english

File:

PDF, 984 KB

english, 1990

16

On the complexity of embedding planar graphs to minimize certain distance measures

Daniel Bienstock, Clyde L. Monma

Journal:

Year:

1990

Language:

english

File:

PDF, 897 KB

english, 1990

17

Computing euclidean maximum spanning trees

Clyde Monma, Michael Paterson, Subhash Suri, Frances Yao

Journal:

Year:

1990

Language:

english

File:

PDF, 756 KB

english, 1990

18

Transitions in geometric minimum spanning trees

Clyde Monma, Subhash Suri

Journal:

Discrete & Computational Geometry

Year:

1992

Language:

english

File:

PDF, 1.71 MB

english, 1992

19

NETPAD: An interactive graphics system for network modeling and optimization

Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma

Journal:

Operations Research Letters

Year:

1995

Language:

english

File:

PDF, 881 KB

english, 1995

20

Preface

Journal:

Annals of Operations Research

Year:

1986

Language:

english

File:

PDF, 57 KB

english, 1986

21

On the Complexity of Covering Vertices by Faces in a Planar Graph

Bienstock, Daniel, Monma, Clyde L.

Journal:

SIAM Journal on Computing

Year:

1988

Language:

english

File:

PDF, 2.87 MB

english, 1988

22

On the Structure of Minimum-Weight k -Connected Spanning Networks

Bienstock, Daniel, Brickell, Ernest F., Monma, Clyde L.

Journal:

SIAM Journal on Discrete Mathematics

Year:

1990

Language:

english

File:

PDF, 1.45 MB

english, 1990

23

Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints

Grötschel, Martin, Monma, Clyde L.

Journal:

SIAM Journal on Discrete Mathematics

Year:

1990

Language:

english

File:

PDF, 2.74 MB

english, 1990

24

Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints

Grötschel, Martin, Monma, Clyde L., Stoer, Mechthild

Journal:

SIAM Journal on Optimization

Year:

1992

Language:

english

File:

PDF, 3.85 MB

english, 1992

25

Linear-Time Algorithms for Scheduling on Parallel Processors

Journal:

Operations Research

Year:

1982

Language:

english

File:

PDF, 943 KB

english, 1982

26

Sequencing to Minimize the Maximum Job Cost

Journal:

Operations Research

Year:

1980

Language:

english

File:

PDF, 259 KB

english, 1980

27

[ACM Press the seventh annual symposium - North Conway, New Hampshire, United States (1991.06.10-1991.06.12)] Proceedings of the seventh annual symposium on Computational geometry - SCG '91 - Transitions in geometric minimum spanning trees (extended abstract)

Monma, Clyde, Suri, Subhash

Year:

1991

Language:

english

File:

PDF, 928 KB

english, 1991

28

Send-and-Split Method for Minimum-Concave-Cost Network Flows

Erickson, Ranel E., Monma, Clyde L., Veinott, Arthur F.

Journal:

Mathematics of Operations Research

Year:

1987

Language:

english

File:

PDF, 2.37 MB

english, 1987

29

Optimal Sequencing via Modular Decomposition: Characterization of Sequencing Functions

Clyde L. Monma and Jeffrey B. Sidney

Journal:

Mathematics of Operations Research

Year:

1987

Language:

english

File:

PDF, 544 KB

english, 1987

30

Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times

Monma, Clyde L., Potts, Chris N.

Journal:

Operations Research

Year:

1993

Language:

english

File:

PDF, 979 KB

english, 1993

31

Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions

Clyde L. Monma, Alexander Schrijver, Michael J. Todd and Victor K. Wei

Journal:

Mathematics of Operations Research

Year:

1990

Language:

english

File:

PDF, 477 KB

english, 1990

32

Sequencing with Series-Parallel Precedence Constraints

Monma, Clyde L., Sidney, Jeffrey B.

Journal:

Mathematics of Operations Research

Year:

1979

Language:

english

File:

PDF, 706 KB

english, 1979

33

Sequencing to Minimize the Maximum Job Cost

Monma, Clyde L.

Journal:

Operations Research

Year:

1980

Language:

english

File:

PDF, 519 KB

english, 1980

34

Sequencing with Series-Parallel Precedence Constraints

Clyde L. Monma and Jeffrey B. Sidney

Journal:

Mathematics of Operations Research

Year:

1979

Language:

english

File:

PDF, 528 KB

english, 1979

35

The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions

Journal:

Operations Research

Year:

1979

Language:

english

File:

PDF, 283 KB

english, 1979

36

Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints

Martin Grötschel, Clyde L. Monma and Mechthild Stoer

Journal:

Operations Research

Year:

1992

Language:

english

File:

PDF, 877 KB

english, 1992

37

Send-and-Split Method for Minimum-Concave-Cost Network Flows

Ranel E. Erickson, Clyde L. Monma and Arthur F. Veinott, Jr.

Journal:

Mathematics of Operations Research

Year:

1987

Language:

english

File:

PDF, 1.50 MB

english, 1987

38

Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints

Monma, Clyde L., Shallcross, David F.

Journal:

Operations Research

Year:

1989

Language:

english

File:

PDF, 834 KB

english, 1989

39

The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions

Monma, Clyde L.

Journal:

Operations Research

Year:

1979

Language:

english

File:

PDF, 295 KB

english, 1979

40

Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints

Grötschel, Martin, Monma, Clyde L., Stoer, Mechthild

Journal:

Operations Research

Year:

1992

Language:

english

File:

PDF, 1.70 MB

english, 1992

41

Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions

Monma, Clyde L., Sidney, Jeffrey B.

Journal:

Mathematics of Operations Research

Year:

1987

Language:

english

File:

PDF, 792 KB

english, 1987

42

Further Development of a Primal-Dual Interior Point Method

Choi, In Chan, Monma, Clyde L., Shanno, David F.

Journal:

INFORMS Journal on Computing

Year:

1990

Language:

english

File:

PDF, 558 KB

english, 1990